An Energy-efficient Multi-candidate Greedy Routing Scheme in Wireless Sensor Networks

نویسندگان

  • Dang Tu Nguyen
  • Wook Choi
  • Minh Thiep Ha
  • Hyunseung Choo
چکیده

Sleep and wake-up scheduling of sensor nodes is an efficient solution to prolong the network lifetime. However, existing scheduling algorithms may significantly decrease the number of active nodes so that the network may be intermittently-connected. In such networks, traditional geographic routing protocols are inappropriate to obtain low latency routes due to route discovery and data forwarding latency. In this paper, we propose a novel multi-candidate greedy routing (MGR) scheme that makes the best effort to find minimum latency routes in the sensor networks. In MGR, each source node sends an RREQ to a set of first wake-up forwarder candidates and selects a route with minimum estimated delivery latency based on their replies. Moreover, to cope with the unreliability of wireless links, we introduce an add-on algorithm for MGR, called multilevel of link quality requirement-based packet forwarding (MLRPF), which helps to increase the energy efficiency of MGR while still guaranteeing a low delivery latency. Simulation results demonstrate that MLRPF increases the routing performance of MGR significantly compared with PRRxDistance [24], DGF [6], and ODML [16] in terms of packet delivery latency and energy efficiency.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Improving Energy Consumption by Using Cluster Based Routing Algorithm in Wireless Sensor Networks

Multi-path is favorite alternative for sensor networks, as it provides an easy mechanism to distributetraffic, as well as considerate fault tolerance. In this paper, a new clustering based multi path routingprotocol namely ECRR (Energy efficient Cluster based Routing algorithm for improving Reliability) isproposed, which is a new routing algorithm and guarantees the achievement to required QoS ...

متن کامل

MLCA: A Multi-Level Clustering Algorithm for Routing in Wireless Sensor Networks

Energy constraint is the biggest challenge in wireless sensor networks because the power supply of each sensor node is a battery that is not rechargeable or replaceable due to the applications of these networks. One of the successful methods for saving energy in these networks is clustering. It has caused that cluster-based routing algorithms are successful routing algorithm for these networks....

متن کامل

Energy Efficiency and Reliability in Underwater Wireless Sensor Networks Using Cuckoo Optimizer Algorithm

Energy efficiency and reliability are widely understood to be one of the dominant considerations for Underwater Wireless Sensor Networks (UWSNs). In this paper, in order to maintain energy efficiency and reliability in a UWSN, Cuckoo Optimization Algorithm (COA) is adopted that is a combination of three techniques of geo-routing, multi-path routing, and Duty-Cycle mechanism. In the proposed alg...

متن کامل

Hybrid Bio-Inspired Clustering Algorithm for Energy Efficient Wireless Sensor Networks

In order to achieve the sensing, communication and processing tasks of Wireless Sensor Networks, an energy-efficient routing protocol is required to manage the dissipated energy of the network and to minimalize the traffic and the overhead during the data transmission stages. Clustering is the most common technique to balance energy consumption amongst all sensor nodes throughout the network. I...

متن کامل

An Efficient Routing Algorithm to Lifetime Expansion in Wireless Sensor Networks

This paper proposes an efficient network architecture to improve energy consumption in Wireless Sensor Networks (WSN). The proposed architecture uses a mobile data collector to a partitioned network. The mobile data collector moves to center of each logical partition after each decision period. The mobile data collector must declare its new location by packet broadcasting to all sensor node...

متن کامل

An Efficient Routing Algorithm to Lifetime Expansion in Wireless Sensor Networks

This paper proposes an efficient network architecture to improve energy consumption in Wireless Sensor Networks (WSN). The proposed architecture uses a mobile data collector to a partitioned network. The mobile data collector moves to center of each logical partition after each decision period. The mobile data collector must declare its new location by packet broadcasting to all sensor node...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • JNW

دوره 6  شماره 

صفحات  -

تاریخ انتشار 2011